Generating Random Networks Without Short Cycles
نویسندگان
چکیده
منابع مشابه
Generating Random Networks Without Short Cycles
Random graph generation is an important tool for studying large complex networks. Despite abundance of random graph models, constructing models with application-driven constraints is poorly understood. In order to advance state-of-the-art in this area, we focus on random graphs without short cycles as a stylized family of graphs, and propose the RandGraph algorithm for randomly generating them....
متن کاملLarge Subgraphs without Short Cycles
We study two extremal problems about subgraphs excluding a family F of graphs. i) Among all graphs with m edges, what is the smallest size f(m,F) of a largest F–free subgraph? ii) Among all graphs with minimum degree δ and maximum degree ∆, what is the smallest minimum degree h(δ,∆,F) of a spanning F– free subgraph with largest minimum degree? These questions are easy to answer for families not...
متن کاملDirected Graphs Without Short Cycles
For a directed graph G without loops or parallel edges, let β(G) denote the size of the smallest feedback arc set, i.e., the smallest subset X ⊂ E(G) such that G \X has no directed cycles. Let γ(G) be the number of unordered pairs of vertices of G which are not adjacent. We prove that every directed graph whose shortest directed cycle has length at least r ≥ 4 satisfies β(G) ≤ cγ(G)/r, where c ...
متن کاملShort Cycles in Random Regular Graphs
Consider random regular graphs of order n and degree d = d(n) ≥ 3. Let g = g(n) ≥ 3 satisfy (d− 1)2g−1 = o(n). Then the number of cycles of lengths up to g have a distribution similar to that of independent Poisson variables. In particular, we find the asymptotic probability that there are no cycles with sizes in a given set, including the probability that the girth is greater than g. A corresp...
متن کاملComputing Graph Roots Without Short Cycles
Graph G is the square of graph H if two vertices x, y have an edge in G if and only if x, y are of distance at most two in H . Given H it is easy to compute its square H, however Motwani and Sudan proved that it is NP-complete to determine if a given graph G is the square of some graph H (of girth 3). In this paper we consider the characterization and recognition problems of graphs that are squ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2018
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.2018.1730